Papers with semantic dependency parsing
N-LTP: An Open-source Neural Language Technology Platform for Chinese (2021.emnlp-demo)
Copied to clipboard
| Challenge: | Existing tools that teach an independent model for each task are not supported in Chinese. |
| Approach: | They propose an open-source neural language platform supporting six Chinese NLP tasks . source code, documentation, and pre-trained models are available at https://github.com/hit-SCIR/ltp . |
| Outcome: | The proposed platform supports six Chinese NLP tasks. |
Multiple Tasks Integration: Tagging, Syntactic and Semantic Parsing as a Single Task (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing systems that bypass intermediate levels of analysis are prone to error propagation and are therefore free from interference. |
| Approach: | They propose a multitask paradigm orthogonal to weight sharing that uses multiple tasks to process input iteratively but concurrently at multiple levels of analysis. |
| Outcome: | The proposed model uses reinforcement learning and release from sequential constraints to improve the quality of the syntactic and semantic parses. |
Learning Joint Semantic Parsers from Disjoint Data (N18-1)
Copied to clipboard
| Challenge: | Various formal meaning representations have been developed corresponding to different semantic theories. |
| Approach: | They propose a method to learn a semantic parser from multiple datasets by treating annotations for unobserved formalisms as latent structured variables. |
| Outcome: | The proposed approach improves on existing methods using unobserved formalisms and underlying corpora. |
Backpropagating through Structured Argmax using a SPIGOT (P18-1)
Copied to clipboard
| Challenge: | Structured projection of intermediate gradients (SPIGOT) is a new method for backpropagating through neural networks . structure-based learning methods for natural language processing are increasingly dominated by end-to-end differentiable functions . |
| Approach: | They propose a structured projection of intermediate gradients method for backpropagating through neural networks that includes hard-decision structured predictions in intermediate layers. |
| Outcome: | The proposed method improves on two structured NLP pipelines: syntactic-then-semantic dependency parsing and semantic parser followed by sentiment classification. |
Auxiliary tasks to boost Biaffine Semantic Dependency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Semantic dependency parsing (SDP) is a task of producing a dependency graph for a sentence. |
| Approach: | They propose to use simple auxiliary tasks that introduce some form of interdependence between arcs to circumvent such an independence of decision. |
| Outcome: | The proposed method shows modest but systematic performance gains on a near-state-of-the-art baseline using transformer-based contextualized representations. |
Project-then-Transfer: Effective Two-stage Cross-lingual Transfer for Semantic Dependency Parsing (2021.eacl-main)
Copied to clipboard
| Challenge: | Several remarkable contributions have been made in syntactic dependency parsing, especially on universal dependencies. |
| Approach: | They propose to capture cross-linguality by combing annotation projection and model transfer of pre-trained language models. |
| Outcome: | The proposed model parser almost achieved the approximated upper bound. |
Semantics as a Foreign Language (D18-1)
Copied to clipboard
| Challenge: | (2017): Syntactic grammars capture propositions, but graph-based representations aim to capture a wider notion of propositions. |
| Approach: | They propose a neural sequence-to-sequence framework which can recover syntactic linearizations by a sequence-based approach. |
| Outcome: | The proposed framework performs almost on-par with previous state-of-the-art approaches while requiring less parallel training annotations. |
DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing parsers that learn graph representations based on static graphs are error-prone and disjointed . Graph-based parser can parse sentences efficiently but suffer from error propagation . |
| Approach: | They propose a dynamic graph learning framework to learn graph representations based on a static graph constructed by an existing parser. |
| Outcome: | The proposed parser outperforms the previous parsers on the SemEval-2015 task 18 dataset in three languages. |
Semantic Dependency Parsing with Edge GNNs (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing semantic dependency parsers use factor graphs to generate a tree structure, but they are ill-suited for a more complex semantic relationship representation. |
| Approach: | They propose a second-order neural CRF parser that uses factor graphs to generate a dependency edge and define neighbors in terms of sibling, co-parent, and grandparent relationships. |
| Outcome: | The proposed model outperforms the first-order biaffine parser on English datasets and shows that it is more efficient than the first order. |
Transition-based Semantic Dependency Parsing with Pointer Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing dependency parsers cannot be directly applied, so they need to be adaptable to deal with the absence of singlehead and connectedness constraints. |
| Approach: | They propose a transition system that produces labelled directed acyclic graphs and performs semantic dependency parsing with Pointer Networks. |
| Outcome: | The proposed system outperforms graph-based models and outperformed existing models on a harder NLP problem. |
Few-Shot Semantic Dependency Parsing via Graph Contrastive Learning (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing graph neural networks (GNNs) have shown promising performance on semantic dependency parsing (SDP) training a high-performing model requires a large amount of labeled data and it is prone to over-fitting in the absence of sufficient labele . |
| Approach: | They propose a syntax-guided graph contrastive learning framework to train GNNs with unlabeled data and fine-tune pre-trained GNN models with few-shot labeled SDP data. |
| Outcome: | The proposed framework achieves promising results when few-shot training samples are available. |